Relative definability of boolean functions via hypergraphs
نویسندگان
چکیده
The aim of this work is to show how hypergraphs can be used as a systematic tool in the classi!cation of continuous boolean functions according to their degree of parallelism. Intuitively f is “less parallel” than g if it can be de!ned by a sequential program using g as its only free variable. It turns out that the poset induced by this preorder is (as for the degrees of recursion) a sup-semilattice. Although hypergraphs have already been used in Bucciarelli (Theoret. Comput. Sci., to appear) as a tool for studying degrees of parallelism, no general result relating the former to the latter has been proved in that work. We show that the sup-semilattice of degrees has a categorical counterpart: we de!ne a category of hypergraphs such that every object “represents” a monotone boolean function; !nite coproducts in this category correspond to lubs of degrees. Unlike degrees of recursion, where every set has a recursive upper bound, monotone boolean functions may have no sequential upper bound. However the ones which do have a sequential upper bound can be nicely characterised in terms of hypergraphs. These subsequential functions play a major role in the proof of our main result, namely that f is less parallel than g if there exists a morphism between their associated hypergraphs. c © 2002 Published by Elsevier Science B.V.
منابع مشابه
Hypergraphs and Degrees of Parallelism: A Completeness Result
In order to study relative PCF-definability of boolean functions, we associate a hypergraph Hf to any boolean function f (following [2, 4]). We introduce the notion of timed hypergraph morphism and show that it is: – Sound: if there exists a timed morphism from Hf to Hg then f is PCF-definable relatively to g. – Complete for subsequential functions: if f is PCF-definable relatively to g, and g ...
متن کاملInvestigations on Relative Definability in Pcf
The focus of this thesis is the study of relative definability of first-order boolean functions with respect to the language PCF, a paradigmatic typed, higher-order language based on the simply-typed λ-calculus. The basic core language is sequential. We study the effect of adding construct that embody various notions of parallel execution. The resulting set of equivalence classes with respect t...
متن کاملIrreducible Boolean Functions
This paper is a contribution to the study of a quasi-order on the set Ω of Boolean functions, the simple minor quasi-order. We look at the join-irreducible members of the resulting poset˜Ω. Using a two-way correspondence between Boolean functions and hypergraphs, join-irreducibility translates into a combinatorial property of hypergraphs. We observe that among Steiner systems, those which yield...
متن کاملFunctional Equations, Constraints, Definability of Function Classes, and Functions of Boolean Variables
The paper deals with classes of functions of several variables defined on an arbitrary set A and taking values in a possibly different set B. Definability of function classes by functional equations is shown to be equivalent to definability by relational constraints, generalizing a fact established by Pippenger in the case A = B = {0, 1}. Conditions for a class of functions to be definable by c...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Theor. Comput. Sci.
دوره 278 شماره
صفحات -
تاریخ انتشار 2002